The Average Case Complexity of the Parallel Prefix Problem

We analyse the average case complexity of evaluating all preexes of an input vector over a given semigroup. As computational model circuits over the semigroup are used and a complexity measure for the average delay of such circuits, called time, is introduced. Based on this notion, we then deene the average case complexity of a computational problem for arbitrary input distributions. For highly nonuniform distributions the average case complexity turns out to be as large as the worst case complexity. Thus, in order to make the average case analysis meaningful we also develop a complexity measure for distributions. Using this framework we show that two n-bit numbers can be added with an average delay of order log log n for a large class of distributions. We then give a complete characterization of the average case complexity of the parallel preex problem with respect to the underlying semigroup. By considering a related reachability problem for nite automata it is shown that the complexity only depends on a property of the semigroup we will call a connuence. Our analysis yields that only two diierent cases can arise for the reachabil-ity question. We show that the parallel preex problem either can be solved with an average delay of order log log n, that means with an exponential speedup compared to the worst case, or in case of nonconnuent semigroups that no speedup is possible. Circuit designs are presented that for connuent semigroups achieve the optimal double logarithmic delay while keeping the circuit size linear. The analysis and results are illustrated at some concrete functions. For the n-ary Boolean OR, THRESHOLD and PARITY, for example, the average case circuit delay is determined exactly up to small constant factors for arbitrary distributions. Finally, we determine the complexity of the reachability problem itself and show that it is at most quadratic in the size of the semigroup.